On the Maximum Achievable Sum-Rate of the RIS-Aided MIMO Broadcast Channel
نویسندگان
چکیده
Reconfigurable intelligent surfaces (RISs) represent a new technology that can shape the radio wave propagation and thus offers great variety of possible performance implementation gains. Motivated by this, we investigate achievable sum-rate optimization in broadcast channel (BC) presence RISs. We solve this problem exploiting well-known duality between Gaussian multiple-input multiple-output (MIMO) BC multiple-access (MAC), correspondingly derive three algorithms which optimize users' covariance matrices RIS phase shifts dual MAC. The are optimized decomposition method with block coordinate maximization (BCM), or gradient-based method. either sequentially using closed-form expression, computed parallel present computational complexity analysis for proposed algorithms. Simulation results show tend to converge same overall, but may produce different some specific situations, due non-convexity considered problem. Also, methods generally more time efficient. In addition, demonstrate provide significant gain RIS-assisted assisted multiple RISs depends on placement
منابع مشابه
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
Abstract— We consider a multi-user multiple input multiple output (MIMO) Gaussian broadcast channel (BC), where the transmitter and receivers have multiple antennas. Since the MIMO broadcast channel is in general a non-degraded broadcast channel, its capacity region remains an unsolved problem. In this paper, we establish a duality between what is termed the “dirty paper” achievable region (the...
متن کاملEvaluation of an achievable rate region for the broadcast channel
Ahwc-The problem of transmission of separate messages to each of two receivers over a general binary-input broadcast channel is investigated. A new approach to a class of information-t problems is developed and applied to obtain boonds on the cardinalitiea of aoxiliary random variables. These bounds permit the calculation of two different regions of achievable rate pairs which are derived from ...
متن کاملAn achievable rate region for the broadcast channel
Let p( yl, y2 1 X) denote a discrete memoryless channel with a single source X and two independent receivers YI and Y2. W e exhibit an achievable region of rates (R11,R12,R22) at which independent information can be sent, respectively, to receiver 1, to both receivers 1 and 2, and to receiver 2. The achievability of the region is shown by using a version of the asymptotic equipartit ion propert...
متن کاملAchievable rate of MIMO channels with data-aided channel estimation and perfect interleaving
The achievable rate of a coherent coded modulation (CM) digital communication system with dataaided channel estimation and a discrete, equiprobable symbol alphabet is derived under the assumption that the system operates on a flat fading MIMO channel and uses an interleaver to combat the bursty nature of the channel. It is shown that linear minimum mean square error (LMMSE) channel estimation d...
متن کاملMaximum Sum-Rate Interference Alignment Schemes for the 3-User Deterministic MIMO Channel
Closed-form solutions exist for the interference alignment (IA) problem in the multiple-input multiple-output (MIMO) interference channel when there are exactly K = 3 users. Specifically, when each user wishes to send d streams and is equipped with N = 2d antennas at both sides of the link, a finite number of IA solutions exist. Exploiting this observation, in this paper we find the maximum sum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2022
ISSN: ['1053-587X', '1941-0476']
DOI: https://doi.org/10.1109/tsp.2022.3229945